Point Location in Time, Voronoi Diagrams in Time, and Other Transdichotomous Results in Computational Geometry
نویسنده
چکیده
Given points in the plane with integer coordinates bounded by , we show that the Voronoi diagram can
منابع مشابه
Transdichotomous Results in Computational Geometry, II: Offline Search
We reexamine fundamental problems from computational geometry in the word RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm for offline point location, a two-dimensional analog of sorting where one needs to order points with respect to segments. This result implies, for example, that the convex hull of n points in three dimensions can be cons...
متن کاملTransdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
Given a planar subdivision whose coordinates are integers bounded by U ≤ 2, we present a linear-space data structure that can answer point location queries in O(min{lgn/ lg lg n,√lgU/ lg lgU}) time on the unit-cost RAM with word size w. This is the first result to beat the standard Θ(lgn) bound for infinite precision models. As a consequence, we obtain the first o(n lgn) (randomized) algorithms...
متن کاملVoronoi Diagrams for Convex Polygon-Offset Distance Functions
In this paper we develop the concept of a convex polygon-offset distance function. Using offset as a notion of distance, we show how to compute the corresponding nearestand furthest-site Voronoi diagrams of point sites in the plane. We provide nearoptimal deterministic O(n(log n + log m) + m)-time algorithms, where n is the number of points and m is the complexity of the underlying polygon, for...
متن کاملIncremental Voronoi diagrams
We study the amortized number of combinatorial changes (edge insertions and removals) needed to update the graph structure of the Voronoi diagram VD(S) (and several variants thereof) of a set S of n sites in the plane as sites are added to the set. To that effect, we define a general update operation for planar graphs that can be used to model the incremental construction of several variants of...
متن کاملVoronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon
Given a set of sites in a simple polygon, a geodesic Voronoi diagram partitions the polygon into regions based on distances to sites under the geodesic metric. We present algorithms for computing the geodesic nearest-point, higher-order and farthest-point Voronoi diagrams of m point sites in a simple n-gon, which improve the best known ones form ≤ n/polylogn. Moreover, the algorithms for the ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006